On hole approximation algorithms in wireless sensor networks
نویسندگان
چکیده
منابع مشابه
Routing Hole Handling Techniques for Wireless Sensor Networks: A Review
A Wireless Sensor Network consists of several tiny devices which have the capability to sense and compute the environmental phenomenon. These sensor nodes are deployed in remote areas without any physical protections. A Wireless Sensor Network can have various types of anomalies due to some random deployment of nodes, obstruction and physical destructions. These anomalies can diminish the sensi...
متن کاملTarget Tracking Based on Virtual Grid in Wireless Sensor Networks
One of the most important and typical application of wireless sensor networks (WSNs) is target tracking. Although target tracking, can provide benefits for large-scale WSNs and organize them into clusters but tracking a moving target in cluster-based WSNs suffers a boundary problem. The main goal of this paper was to introduce an efficient and novel mobility management protocol namely Target Tr...
متن کاملCoverage Hole Detection in Wireless Sensor Networks
Wireless sensor network is the area where many researchers are focusing. The emerging technology of WSN is expected to provide a broad range of applications, such as battlefield surveillance, environmental monitoring and smart space and so on. Coverage is the important quality of service which is provided by the wireless sensor network. The coverage hole problem is a fundamental issue in WSN. T...
متن کاملMultiple Target Tracking in Wireless Sensor Networks Based on Sensor Grouping and Hybrid Iterative-Heuristic Optimization
A novel hybrid method for tracking multiple indistinguishable maneuvering targets using a wireless sensor network is introduced in this paper. The problem of tracking the location of targets is formulated as a Maximum Likelihood Estimation. We propose a hybrid optimization method, which consists of an iterative and a heuristic search method, for finding the location of targets simultaneously. T...
متن کاملApproximation Algorithms For Wireless Sensor Deployment
We develop an integer linear programming formulation to find a minimum cost deployment of sensors so at attain desired coverage of a target point set. Additionally ǫ-approximation algorithms and a polynomial time approximation scheme are proposed for the case of grid coverage. Experiments demonstrate the superiority of our proposed algorithms over earlier algorithms for point coverage of grids.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2015
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/30/4/3965